Meta-Meta is better-better!
نویسندگان
چکیده
The increasing openness and heterogeneity of distributed computing systems requires the representation of meta-information in distributed environments. Most type management systems can only define types within particular type systems. In contrast, the DSTC’s Meta-Object Facility (MOF) first defines a type system as a set of meta-meta-objects, and then defines types as meta-objects which are described by those meta-meta-objects. This approach enables the definition of many type systems in one MOF, the composition of type systems, and the federation of type systems. This paper presents a conceptual framework for discussing metainformation and the meta-meta-objects that are the foundation of the DSTC’s MetaObject Facility (MOF), which is a tool for enabling heterogeneity, extensibility and openness.
منابع مشابه
Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics
In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...
متن کاملA hybrid meta-heuristic algorithm based on ABC and Firefly algorithms
Abstract— In this paper we have tried to develop an altered version of the artificial bee colony algorithm which is inspired from and combined with the meta-heuristic algorithm of firefly. In this method, we have tried to change the main equation of searching within the original ABC algorithm. On this basis, a new combined equation was used for steps of employed bees and onlooker bees. For this...
متن کاملTesting Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures
Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملEvidence-Based ACL Reconstruction
There is controversy in the literature regarding a number of topics related to anterior cruciate ligament (ACL)reconstruction. The purpose of this article is to answer the following questions: 1) Bone patellar tendon bone (BPTB) reconstruction or hamstring reconstruction (HR); 2) Double bundle or single bundle; 3) Allograft or authograft; 4) Early or late reconstruction; 5) Rate of return to sp...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کامل